Modal Mantık'ta 'Strict Implication-Material Implication' (Sıkı Gerektirme-Maddi Gerektirme) Teorisi

Complexity of Strict Implication

The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner’s Theorem remains valid when we restrict the language to the strict implication fragment, and that the same holds for Hemaspaandra’s Theorem. As a consequence we have that the validity problem for most standard normal modal logics is the same ...

Priorean Strict Implication, Q and Related Systems

Lewis meets Brouwer: constructive strict implication

C. I. Lewis invented modern modal logic as a theory of “strict implication” J. Over the classical propositional calculus one can as well work with the unary box connective, which became the modal primitive ever since. Over the intuitionistic propositional calculus, however, the strict implication has greater expressive power than 2 and allows to make distinctions invisible in the ordinary synta...

STRICT-WEAK LANGUAGES. An analysis of strict implication∗

Modal languages were originally based on the possible-world approach proposed by Lewis, Carnap and others. In other words, modal languages were originally designed to talk about necessity (the box) and possibility (the diamond). Nowadays, modal languages (and certain natural extensions like dynamic languages, μ-calculus language, . . . ) are viewed as tools for analyzing the properties of Kripk...

Three-Dimensional Stateful Material Implication Logic

Monolithic three-dimensional integration of memory and logic circuits could dramatically improve performance and energy efficiency of computing systems. Some conventional and emerging memories are suitable for vertical integration, including highly scalable metaloxide resistive switching devices (“memristors”), yet integration of logic circuits proves to be much more challenging. Here we demons...